#include "BinaryTree.h"

void PrevOrder(Tree* root)
{
    if(root == NULL)
    {
        printf("NULL ");
        return;
    }

    printf("%c ", root->data);
    PrevOrder(root->left);
    PrevOrder(root->right);
}


void InOrder(Tree* root)
{
     if(root == NULL)
    {
        printf("NULL ");
        return;
    }

    PrevOrder(root->left);
    printf("%c ", root->data);
    PrevOrder(root->right);
}
